Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting
نویسندگان
چکیده
منابع مشابه
Bug Hunting with False Negatives
Safe data abstractions are widely used for verification purposes. Positive verification results can be transferred to the concrete system. When a property is violated in the abstract system, one still has to check whether a concrete violation exists. However, even when the violation scenario is not reproducible in the concrete system (a false negative), it may still contain information on possi...
متن کاملBug Hunting By Computing Range Reduction
We describe a method of model checking called Computing Range Reduction (CRR). The CRR method is based on derivation of clauses that reduce the set of traces of reachable states in such a way that at least one counterexample remains (if any). These clauses are derived by a technique called Partial Quantifier Elimination (PQE). Given a number n, the CRR method finds a counterexample of length le...
متن کاملEffective Bug Hunting with Spin and Modex
This tutorial consists of two parts. In the first part we present an advanced overview of Spin [1, 4], and illustrate its practical application to logic model checking problems. In the second part of the tutorial we present an overview of a related tool called Modex [2, 3]. Modex can be used to extract Spin verification models directly from C source code. It supports the definition of user-defi...
متن کاملBug Hunting with False Negatives Revisited
Safe data abstractions are widely used for verification purposes. Positive verification results can be transferred from the abstract to the concrete system. When a property is violated in the abstract system, one still has to check whether a concrete violation scenario exists. However, even when the violation scenario is not reproducible in the concrete system (a false negative), it may still c...
متن کاملSuspect Set Prediction in RTL Bug Hunting
We propose a framework for predicting erroneous design components from partially observed solution sets that are found through automated debugging tools. The proposed method involves learning design component dependencies by using historical debugging data and representing these dependencies by means of a probabilistic graph. Using this representation, one can run a debugging tool non-exhaustiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80665-0